منابع مشابه
Context-Free Graph Grammars
Graph grammars have been studied by several authors. The motivations of these works have arisen from completely different areas of computer science, such as picture processing (Pfaltz and Rosenfeld, 1969; Montanari, 1970; Rosenfeld and Milgram, 1972; Pavlidis, 1972; Abe et al., 1973; Furtado and Mylopoulos, 1975; Fu and Brayer, 1975) or formal semantics of programming languages (Pratt, 1971). I...
متن کاملGraph representation of context-free grammars
In modern mathematics, graphs figure as one of the better-investigated class of mathematical objects. Various properties of graphs, as well as graph-processing algorithms, can be useful if graphs of a certain kind are used as denotations for CF-grammars. Furthermore, graph are well adapted to various extensions (one kind of such extensions being attributes). This paper describes a class of grap...
متن کاملGraph Interpolation Grammars as Context-Free Automata
A derivation step in a Graph Interpolation Grammar has the effect of scanning an input token. This feature, which aims at emulating the incrementality of the natural parser, restricts the formal power of GIGs. This contrasts with the fact that the derivation mechanism involves a context-sensitive device similar to tree adjunction in TAGs. The combined effect of input-driven derivation and restr...
متن کاملRecursive Queries and Context-free Graph Grammars
The semantics of a recursive query in the context of a relational database can be formalized in terms ofa context-free graph grammar associated with it. This grammargenerates oriented, labeled hypergraphs. The labels of the hypercdges of these hypergraphs, called the computation graphs of the query, are the names of the relations forming the database under consideration. Some
متن کاملAbout Graph and Hypergraph Context Free Grammars
The main idea of this paper is to show some important differences between graph grammars and hypergraph grammars in context of freeness. On the other hand, we give a possibility to transform the planar structure of a hypergraph into a linear one with concern of determinism. This can create a path to transform a pushdown automaton into a generative grammar equivalent. Key-Words: Hyperedge Replac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1978
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(78)90528-4